PARAMETERIZED PROOF COMPLEXITY Stefan Dantchev, Barnaby Martin, and Stefan Szeider Abstract. We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractabl

Source URL: www.bedewell.com

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Source URL: www.bedewell.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• NP-complete problems
• Complexity classes
• Logic in computer science
• Finite model theory
• Parameterized complexity
• Resolution
• Exponential time hypothesis
• Boolean satisfiability problem
• Conjunctive normal form

Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki

Source URL: rutcor.rutgers.edu

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• Order theory
• Parameterized complexity
• NP
• Exponential time hypothesis
• Randomized algorithm
• Time complexity
• Partially ordered set
• Order dimension

CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

Source URL: theory.stanford.edu

• Online algorithms
• Analysis of algorithms
• Cache
• Computer science
• Applied mathematics
• Mathematics
• Cache algorithms
• Algorithm
• Competitive analysis
• Computational complexity theory
• Page replacement algorithm

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• NP-complete problems
• Boolean algebra
• Parameterized complexity
• Boolean satisfiability problem
• Constraint satisfaction problem
• Exponential time hypothesis
• Treewidth
• Tree decomposition

On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

Source URL: rutcor.rutgers.edu

• NP-complete problems
• Graph theory
• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Maximal independent set
• Independent set
• Matching
• Bipartite graph
• Degree
• Graph
• Line graph

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Source URL: theory.stanford.edu

• NP-complete problems
• Computational complexity theory
• Analysis of algorithms
• Operations research
• NP-hard problems
• Vertex cover
• Travelling salesman problem
• Dynamic programming
• Parameterized complexity
• Independent set
• Algorithm
• 2-satisfiability

Parameterized Average-Case Complexity of the Hypervolume Indicator Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

• Analysis of algorithms
• Worst-case complexity
• Parameterized complexity
• P versus NP problem

Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡ Matthias Mnich§

Source URL: people.mpi-inf.mpg.de

• NP-complete problems
• Graph operations
• Steiner tree problem
• Treewidth
• Edge contraction
• Graph
• Spanning tree
• Graph connectivity
• Minimum bottleneck spanning tree
• Planar separator theorem

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Source URL: www.cs.siu.edu

• NP-complete problems
• Theoretical computer science
• Analysis of algorithms
• Parameterized complexity
• Independent set
• Algorithm
• Kernelization
• Book:Graph Theory
• Book:Graph Algorithms